Semi-pullbacks and bisimulation in categories of Markov processes
نویسنده
چکیده
Received We show that the category whose objects are famidclies of Markov processes on Polish spaces, with a given transition kernel, and whose morphisms are transition probability preserving, surjective continuous maps has semi-pullbacks, i.e. for any pair of morphisms fi : Si ! S (i = 1; 2), there exists an object V and morphisms i : V ! Si (i = 1; 2) such that f1 1 = f2 2. This property holds for various full subcategories, including that of families of Markov processes on locally compact second countable spaces and also in the larger category where the objects are families of Markov processes on analytic spaces and morphisms are transition probability preserving surjective Borel maps. It also follows that the category of probability measures on Polish spaces and measure-preserving continuous surjective maps has semi-pullbacks. A main consequence of our result is that probabilistic bisimulation for labelled Markov processes on all these categories, deened in terms of spans of morphisms, is an equivalence relation.
منابع مشابه
Unprovability of the Logical Characterization of Bisimulation
We quickly review labelled Markov processes (LMP) and provide a counterexample showing that in general measurable spaces, event bisimilarity and state bisimilarity differ in LMP. This shows that the logic in Desharnais [3] does not characterize state bisimulation in non-analytic measurable spaces. Furthermore we show that, under current foundations of Mathematics, such logical characterization ...
متن کاملThe theory of interactive generalized semi-Markov processes
In this paper we introduce the calculus of interactive generalized semi-Markov processes (IGSMPs), a stochastic process algebra which can express probabilistic timed delays with general distributions and synchronizable actions with zero duration, and where choices may be probabilistic, non-deterministic and prioritized. IGSMP is equipped with a structural operational semantics which generates s...
متن کاملAutonomic Service-Component Ensembles TR 09: Coalgebraic Bisimulation of FuTS
Labeled state-to-function transition systems, FuTSs for short, capture transition schemes incorporating multiplicities from states to functions of finite support over general semirings. As such FuTSs constitute a convenient modeling instrument to deal with process languages and their stochastic extensions in particular. In this paper, the notion of bisimulation induced by a FuTS is addressed fr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Mathematical Structures in Computer Science
دوره 9 شماره
صفحات -
تاریخ انتشار 1999